Monotonicity in quantifier verification

نویسندگان

  • Jakub Szymanik
  • Marcin Zajenkowski
چکیده

Monotonicity is considered to be one of the key properties of languages both in logic and linguistics. In model theory it contributes to definability (see e.g. Väänänen and Westerståhl, 2002), in linguistics it is used, among other applications, to explain the phenomenon of negative polarity items (see e.g. Ladusaw, 1979). There are also strong links between monotonicity and learnability (see e.g. Tiede, 1999). Moreover, there are good reasons to believe that it is crucial for processing natural language expressions, as has already been suggested by psychologists (see e.g.Moxey et al., 2001), linguists and logicians (see e.g., Barwise and Cooper, 1981). In fact, Geurts (2003) shows that when it comes to reasoning in natural language downward monotone quantifiers, e.g., “No boy”, are more difficult than upward monotone quantifiers, e.g., “Every boy”.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Monotonicity has only a relative effect on the complexity of quantifier verification

We discuss a computational model of quantifier verification. It predicts that there is no effect of monotonicity on the verification of numerical quantifiers but only the interaction of monotonicty and sentential truth-values. Moreover, it predicts no monotonicity or interaction with truth-values effects for proportional quantifiers. We present an experimental study supporting the predictions o...

متن کامل

Monotonicity and Processing Load

Starting out from the assumption that monotonicity plays a central role in interpretation and inference, we derive a number of predictions about the complexity of processing quantified sentences. A quantifier may be upward entailing (i.e. license inferences from subsets to supersets) or downward entailing (i.e. license inferences from supersets to subsets). Our main predictions are the followin...

متن کامل

Verifying Mixed Real-Integer Quantifier Elimination

We present a formally verified quantifier elimination procedure for the first order theory over linear mixed real-integer arithmetics in higher-order logic based on a work by Weispfenning. To this end we provide two verified quantifier elimination procedures: for Presburger arithmitics and for linear real arithmetics.

متن کامل

Interpretation and Processing Time of Generalized Quantifiers: Why your Mental Space Matters

Classical quantifiers (e.g., “all”, “some” and “none”) have been extensively studied in logic and psychology. In contrast, generalized quantifiers (e.g., “most”) allow for fine-grained statements about quantities. The discrepancy in the underlying mental representation and its interpretation among interpreters can affect language use and reasoning. We investigated the effect of quantifier type,...

متن کامل

Witness Sets, Polarity Reversal and the Processing of Quantified Sentences

Experimental results show that the monotonicity of a quantifier (Q) affects how it is processed [4, 7, 6]. Q′s are upward entailing (UE) if they permit inferences to supersets, i.e. from Q A B follows Q A B’ for any B ⊆ B′ (e.g. every, at least five). If from Q A B it follows that Q A B’ for any B′ ⊆ B, the quantifier Q is downward entailing (DE) (e.g. no, at most five). As compared to UE Q’s, ...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2010